Stream VByte : Faster byte-oriented integer compression
نویسندگان
چکیده
منابع مشابه
Stream VByte: Faster Byte-Oriented Integer Compression
Arrays of integers are often compressed in search engines. Though there are many ways to compress integers, we are interested in the popular byte-oriented integer compression techniques (e.g., VByte or Google’s VARINT-GB). Although not known for their speed, they are appealing due to their simplicity and engineering convenience. Amazon’s VARINT-G8IU is one of the fastest byte-oriented compressi...
متن کاملLoiss: A Byte-Oriented Stream Cipher
This paper presents a byte-oriented stream cipher – Loiss, which takes a 128-bit initial key and a 128-bit initial vector as inputs, and outputs a key stream of bytes. The algorithm is based on a linear feedback shift register, and uses a structure called BOMM in the filter generator, which has good property on resisting against algebraic attacks, linear distinguishing attacks and fast correlat...
متن کاملVectorized VByte Decoding
We consider the ubiquitous technique of VByte compression, which represents each integer as a variable length sequence of bytes. The low 7 bits of each byte encode a portion of the integer, and the high bit of each byte is reserved as a continuation flag. This flag is set to 1 for all bytes except the last, and the decoding of each integer is complete when a byte with a high bit of 0 is encount...
متن کاملFaster deterministic integer factorization
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4 logN)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan–Gaudry–Schost, following the Pollard–Strassen approach. We show that this bound can be improved by a factor of √
متن کاملFaster truncated integer multiplication
Let n > 1 and let u and v be integers in the interval 0 6 u, v < 2. We write M(n) for the cost of computing the full product of u and v, which is just the usual 2n-bit product uv. Unless otherwise specified, by ‘cost’ we mean the number of bit operations, under a model such as the multitape Turing machine [12]. In this paper we are interested in two types of truncated product. The low product o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2018
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2017.09.011